On Capacity Computation for the Two-User Binary Multiple-Access Channel

نویسندگان

  • Jörg Bühler
  • Gerhard Wunder
چکیده

This paper deals with the problem of computing the boundary of the capacity region for the memoryless two-user binary-input binary-output multiple-access channel ((2, 2; 2)MAC), or equivalently, the computation of input probability distributions maximizing weighted sum-rate. This is equivalent to solving a difficult nonconvex optimization problem. For a restricted class of (2, 2; 2)-MACs and weight vectors, it is shown that, depending on an ordering property of the channel matrix, the optimal solution is located on the boundary, or the objective function has at most one stationary point in the interior of the domain. For this, the problem is reduced to a pseudoconcave one-dimensional optimization and the single-user problem.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Information-Theoretical Security for Several Models of Multiple-Access Channel

Several security models of multiple-access channel (MAC) are investigated. First, we study the degraded MAC with confidential messages, where two users transmit their confidential messages (no common message) to a destination, and each user obtains a degraded version of the output of the MAC. Each user views the other user as a eavesdropper, and wishes to keep its confidential message as secret...

متن کامل

Bounds for Multiple-Access Relay Channels with Feedback via Two-way Relay Channel

In this study, we introduce a new two-way relay channel and obtain an inner bound and an outer bound for the discrete and memoryless multiple access relay channels with receiver-source feedback via two-way relay channel in which end nodes exchange signals by a relay node. And we extend these results to the Gaussian case. By numerical computing, we show that our inner bound is the same with o...

متن کامل

Secrecy Capacity Region of Binary and Gaussian Multiple Access Channels

Abstract— A generalized multiple access channel (GMAC) with one confidential message set is studied, where two users (users 1 and 2) attempt to transmit common information to a destination, and user 1 also has confidential information intended for the destination. Moreover, user 1 wishes to keep its confidential information as secret as possible from user 2. A deterministic GMAC is first studie...

متن کامل

Nonlinear Turbo Codes for the AWGN Channel with Higher-Order Modulations and the OR Multiple Access Channel

This paper addresses the problem of designing parallel concatenated nonlinear trellis codes (PC-NLTCs). These codes have advantages over binary linear turbo codes for higher-order modulations or in applications where a non-uniform distribution of ones and zeros in the output is optimal. Two applications are considered in this work. First, this paper shows that for higher-order modulations using...

متن کامل

Rayleigh Fading Multiple Access Channel Without Channel State Information

In this paper we determine bounds of the capacity region of a two-user multiple-access channel with Rayleigh fading when neither the transmitters nor the receiver has channel state information (CSI). We assume that the fading coefficients as well as the additive noise are zero-mean complex Gaussian and there is an average power constraint at the channel input for both senders. Results that we g...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009